Rendering Polygonal Scenes with Di raction Account
نویسنده
چکیده
Global processing of diiraction phenomena by a half-plane was proposed by Aveneau and M eriaux, using the Geometrical Theory of Diiraction. In this theory, diiraction rays are emitted by diiraction points belonging to the half-plane edge (or dihedron edge). The solution given for nding these points being numerical, it is diicult to implement and leads to low precision solutions with a slow algorithm. In this paper we rst propose a new geometric solution for nding the dihedron diiraction points, which leads to an eecient analytic algorithm. Next we present an implementation of a Ray-Tracing software for polygonal scenes with an automatic diiraction treatment. Since this implies diiraction by dihedra, we present the dihedron data structure and the corresponding algorithm which solves two problems : the existence of diiraction paths, and the impossibility for dihedra to share their edge. These elements lead to an implementation of a Ray-Tracing software with rst diiraction account for any polygonal scenes.
منابع مشابه
Combined 3D visualization of volume data and polygonal models using a Shear-Warp algorithm
Shear-Warp techniques provide an e$cient way to perform the projection and blending stages of the volume-rendering process. They treat volume-data slices in a coherent order and can be naturally integrated with the Z-Bu!er algorithm. The present paper presents a study on the integration between Shear-Warp and Z-Bu!er, and extends the Shear-Warp algorithm to handle scenes composed of both volume...
متن کاملGeneration of Subdivision Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task. In recent years, view-frustum and occlusion culling have drawn a lot of attention for reducing the complexity of those scenes. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present t...
متن کاملGeneration of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models
Efficient handling of large polygonal scenes has always been a challenging task and in recent years, view-frustum and occlusion culling have drawn a lot of attention for accomplishing this goal. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall performance. In this paper, we present three adapted ...
متن کاملProgressive Blue Surfels
In this paper we describe a new technique to generate and use surfels for rendering of highly complex, polygonal 3D scenes in real time. The basic idea is to approximate complex parts of the scene by rendering a set of points (surfels). The points are computed in a preprocessing step and offer two important properties: They are placed only on the visible surface of the scene’s geometry and they...
متن کاملFIFI LS: the optical design and di raction analysis
We present the optical system of the Field-Imaging Far-Infrared Line Spectrometer (FIFI LS) for the SOFIA airborne observatory. The instrument is designed to allow di raction limited integral eld spectroscopy in the far infrared wavelength range 42 to 210 microns. Two parallel wavelength channels (42 110 microns and 110 210 microns) employ Littrow mounted di raction gratings with anamorphic col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999